Stochastic Optimal Path Problem with Relays
نویسندگان
چکیده
منابع مشابه
Stochastic Shortest Path Problem with Uncertain Delays
This paper considers a stochastic version of the shortest path problem, the Stochastic Shortest Path Problem with Delay Excess Penalty on directed, acyclic graphs. In this model, the arc costs are deterministic, while each arc has a random delay, assumed normally distributed. A penalty occurs when the given delay constraint is not satisfied. The objective is to minimize the sum of the path cost...
متن کاملMinimum cost path problems with relays
The Minimum Cost Path Problem with Relays (MCPPR) consists of finding a minimum cost path from a source to a destination, along which relay nodes are located at a certain cost, subject to a weight constraint. This paper first models the MCPPR as a particular bicriteria path problem involving an aggregated function of the path and relay costs, as well as a weight function. A variant of this prob...
متن کاملEfficient Dimensionality Reduction of Directional Overcurrent Relays Optimal Coordination Problem
Directional over current relays (DOCR) are commonly used in power system protection as a primary protection in distribution and sub-transmission electrical systems and as a secondary protection in transmission systems. Coordination of protective relays is necessary to obtain selective tripping. In this paper, an approach for efficiency reduction of DOCRs nonlinear optimum coordination (OC) is p...
متن کاملThe Optimal Path-Matching Problem
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems|polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for ...
متن کاملOptimal Transportation Problem by Stochastic Optimal Control
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theorem by a zero noise limit (or vanishing viscosity) argument.. We also obtain a characterization of the support of an optimal measure in Monge-Kantorovich minimization problem (MKP) as a graph. Our key tool is a duality r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2015
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2015.06.008